SlideShare a Scribd company logo

computer notes - Data Structures - 21

Download as PPT, PDF
E
ecomputernotes

The document describes various tree rotation operations used to rebalance binary search trees, including single and double rotations. Single rotations include single right rotation and single left rotation, which rotate the tree around a single node. Double rotations first perform a single rotation on one child then a single rotation on the original node, such as double right-left rotation and double left-right rotation.

TechnologyEntertainment & Humor
1 of 37
Download to read offline
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
Class No.21 Data Structures http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
int height( TreeNode<int>* node ) { if( node != NULL ) return node->getHeight(); return -1; }  height http://ecomputernotes.com
int height( TreeNode<int>* node ) { if( node != NULL ) return node->getHeight(); return -1; }  height http://ecomputernotes.com
TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
TreeNode<int>* doubleRightLeftRotation(TreeNode<int>* k1) { if( k1 == NULL ) return NULL; // single right rotate with k3 (k1's right child) k1->setRight( singleRightRotation(k1->getRight())); // now single left rotate with k1 as the root return singleLeftRotation(k1); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
TreeNode<int>* doubleRightLeftRotation(TreeNode<int>* k1) { if( k1 == NULL ) return NULL; // single right rotate with k3 (k1's right child) k1->setRight( singleRightRotation(k1->getRight())); // now single left rotate with k1 as the root return singleLeftRotation(k1); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
TreeNode<int>* doubleRightLeftRotation(TreeNode<int>* k1) { if( k1 == NULL ) return NULL; // single right rotate with k3 (k1's right child) k1->setRight( singleRightRotation(k1->getRight())); // now single left rotate with k1 as the root return singleLeftRotation(k1); }  k 1 k 2 D A B C k 3 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
TreeNode<int>* doubleLeftRightRotation(TreeNode<int>* k3) { if( k3 == NULL ) return NULL; // single left rotate with k1 (k3's left child) k3->setLeft( singleLeftRotation(k3->getLeft())); // now single right rotate with k3 as the root return singleRightRotation(k3); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
TreeNode<int>* doubleLeftRightRotation(TreeNode<int>* k3) { if( k3 == NULL ) return NULL; // single left rotate with k1 (k3's left child) k3->setLeft( singleLeftRotation(k3->getLeft())); // now single right rotate with k3 as the root return singleRightRotation(k3); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
TreeNode<int>* doubleLeftRightRotation(TreeNode<int>* k3) { if( k3 == NULL ) return NULL; // single left rotate with k1 (k3's left child) k3->setLeft( singleLeftRotation(k3->getLeft())); // now single right rotate with k3 as the root return singleRightRotation(k3); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
Deletion in AVL Tree Delete is the inverse of insert: given a value X and an AVL tree T, delete the node containing X and rebalance the tree, if necessary. Turns out that deletion of a node is considerably more complex than insert http://ecomputernotes.com
Deletion in AVL Tree Insertion in a height-balanced tree requires at most one single rotation or one double rotation. We can use rotations to restore the balance when we do a deletion. We may have to do a rotation at every level of the tree: log 2 N rotations in the worst case. http://ecomputernotes.com
Deletion in AVL Tree Here is a tree that causes this worse case number of rotations when we delete A. At every node in N’s left subtree, the left subtree is one shorter than the right subtree. A C D N E J G I F H K L M http://ecomputernotes.com
Deletion in AVL Tree Deleting A upsets balance at C. When rotate (D up, C down) to fix this A C D N E J G I F H K L M http://ecomputernotes.com
Deletion in AVL Tree Deleting A upsets balance at C. When rotate (D up, C down) to fix this C D N E J G I F H K L M http://ecomputernotes.com
Deletion in AVL Tree The whole of F’s left subtree gets shorter. We fix this by rotation about F-I: F down, I up. C D N E J G I F H K L M http://ecomputernotes.com
Deletion in AVL Tree The whole of F’s left subtree gets shorter. We fix this by rotation about F-I: F down, I up. C D N E J G I F H K L M http://ecomputernotes.com
Deletion in AVL Tree This could cause imbalance at N. The rotations propagated to the root. C D N E J G I F H K L M http://ecomputernotes.com
Deletion in AVL Tree Procedure Delete the node as in binary search tree (BST). The node deleted will be either a leaf or have just one subtree. Since this is an AVL tree, if the deleted node has one subtree, that subtree contains only one node (why?) Traverse up the tree from the deleted node checking the balance of each node. http://ecomputernotes.com
Deletion in AVL Tree There are 5 cases to consider. Let us go through the cases graphically and determine what action to take. We will not develop the C++ code for deleteNode in AVL tree. This will be left as an exercise. http://ecomputernotes.com
Deletion in AVL Tree Case 1a : the parent of the deleted node had a balance of 0 and the node was deleted in the parent’s left subtree. Action : change the balance of the parent node and stop. No further effect on balance of any higher node. Delete on this side http://ecomputernotes.com
Deletion in AVL Tree Here is why; the height of left tree does not change. 1 2 3 4 5 6 7 0 1 2
Deletion in AVL Tree Here is why; the height of left tree does not change. 1 2 3 4 5 6 7 2 3 4 5 6 7 0 1 2 remove(1)
Deletion in AVL Tree Case 1b : the parent of the deleted node had a balance of 0 and the node was deleted in the parent’s right subtree. Action : (same as 1a ) change the balance of the parent node and stop. No further effect on balance of any higher node. Delete on this side
Deletion in AVL Tree Case 2a : the parent of the deleted node had a balance of 1 and the node was deleted in the parent’s left subtree. Action : change the balance of the parent node. May have caused imbalance in higher nodes so continue up the tree. Delete on this side

More Related Content

PPT
Computer notes - singleRightRotation
ecomputernotes
 
DOCX
Spark_Documentation_Template1
Nagavarunkumar Kolla
 
PDF
Rand final
Thea Krissa Langit
 
PDF
Java: Nie popełniaj tych błędów!
Daniel Pokusa
 
PDF
Apply Hammer Directly to Thumb; Avoiding Apache Spark and Cassandra AntiPatt...
Databricks
 
PDF
GeoMesa on Apache Spark SQL with Anthony Fox
Databricks
 
PDF
An Introduction to RxJava
K. Matthew Dupree
 
PDF
Goal Based Data Production with Sim Simeonov
Databricks
 
Computer notes - singleRightRotation
ecomputernotes
 
Spark_Documentation_Template1
Nagavarunkumar Kolla
 
Rand final
Thea Krissa Langit
 
Java: Nie popełniaj tych błędów!
Daniel Pokusa
 
Apply Hammer Directly to Thumb; Avoiding Apache Spark and Cassandra AntiPatt...
Databricks
 
GeoMesa on Apache Spark SQL with Anthony Fox
Databricks
 
An Introduction to RxJava
K. Matthew Dupree
 
Goal Based Data Production with Sim Simeonov
Databricks
 

What's hot (20)

PDF
Powering code reuse with context and render props
Forbes Lindesay
 
PDF
Earth Engine on Google Cloud Platform (GCP)
Runcy Oommen
 
PDF
Better than you think: Handling JSON data in ClickHouse
Altinity Ltd
 
PDF
Appendix of downlink coverage probability in heterogeneous cellular networks ...
Cora Li
 
PDF
AJUG April 2011 Cascading example
Christopher Curtin
 
PDF
Appendix of heterogeneous cellular network user distribution model
Cora Li
 
PDF
Clustering your Application with Hazelcast
Hazelcast
 
PDF
K means clustering
Kuppusamy P
 
PDF
Application of Google Earth Engine in Open NAPs
NAP Events
 
PDF
Discrete control2 converted
cairo university
 
PDF
A Note on PCVB0 for HDP-LDA
Tomonari Masada
 
PDF
Pyclustering tutorial - BANG
Andrei Novikov
 
PDF
Guaranteeing Consensus in Distriubuted Systems with CRDTs
Sun-Li Beatteay
 
PDF
The Ring programming language version 1.3 book - Part 43 of 88
Mahmoud Samir Fayed
 
DOCX
java experiments and programs
Karuppaiyaa123
 
PPTX
BMC Keynote @ 2016 Hadoop Summit
Jennifer Stern
 
DOCX
Project Term2 Computer barun.docx
SakshamSharma382989
 
PDF
Scaling up data science applications
Kexin Xie
 
DOCX
Control assignment#4
cairo university
 
PDF
Elastic response pseudo spectrum in c programming
Salar Delavar Qashqai
 
Powering code reuse with context and render props
Forbes Lindesay
 
Earth Engine on Google Cloud Platform (GCP)
Runcy Oommen
 
Better than you think: Handling JSON data in ClickHouse
Altinity Ltd
 
Appendix of downlink coverage probability in heterogeneous cellular networks ...
Cora Li
 
AJUG April 2011 Cascading example
Christopher Curtin
 
Appendix of heterogeneous cellular network user distribution model
Cora Li
 
Clustering your Application with Hazelcast
Hazelcast
 
K means clustering
Kuppusamy P
 
Application of Google Earth Engine in Open NAPs
NAP Events
 
Discrete control2 converted
cairo university
 
A Note on PCVB0 for HDP-LDA
Tomonari Masada
 
Pyclustering tutorial - BANG
Andrei Novikov
 
Guaranteeing Consensus in Distriubuted Systems with CRDTs
Sun-Li Beatteay
 
The Ring programming language version 1.3 book - Part 43 of 88
Mahmoud Samir Fayed
 
java experiments and programs
Karuppaiyaa123
 
BMC Keynote @ 2016 Hadoop Summit
Jennifer Stern
 
Project Term2 Computer barun.docx
SakshamSharma382989
 
Scaling up data science applications
Kexin Xie
 
Control assignment#4
cairo university
 
Elastic response pseudo spectrum in c programming
Salar Delavar Qashqai
 
Ad

Viewers also liked (20)

PPT
computer notes - Data Structures - 38
ecomputernotes
 
PPT
computer notes - Data Structures - 5
ecomputernotes
 
PPT
computer notes - Data Structures - 12
ecomputernotes
 
PPT
computer notes - Data Structures - 14
ecomputernotes
 
PPT
computer notes - Data Structures - 4
ecomputernotes
 
PPT
computer notes - Data Structures - 20
ecomputernotes
 
PPT
computer notes - Data Structures - 18
ecomputernotes
 
PPT
computer notes - Data Structures - 1
ecomputernotes
 
PPT
computer notes - Data Structures - 28
ecomputernotes
 
PPT
computer notes - Data Structures - 27
ecomputernotes
 
PPT
computer notes - Data Structures - 33
ecomputernotes
 
PPT
computer notes - Data Structures - 19
ecomputernotes
 
PPT
computer notes - Data Structures - 39
ecomputernotes
 
PPT
computer notes - Data Structures - 3
ecomputernotes
 
PPT
computer notes - Data Structures - 26
ecomputernotes
 
PPT
computer notes - Data Structures - 29
ecomputernotes
 
PPT
computer notes - Data Structures - 8
ecomputernotes
 
PPT
computer notes - Data Structures - 31
ecomputernotes
 
PPT
computer notes - Data Structures - 9
ecomputernotes
 
PPT
computer notes - Data Structures - 7
ecomputernotes
 
computer notes - Data Structures - 38
ecomputernotes
 
computer notes - Data Structures - 5
ecomputernotes
 
computer notes - Data Structures - 12
ecomputernotes
 
computer notes - Data Structures - 14
ecomputernotes
 
computer notes - Data Structures - 4
ecomputernotes
 
computer notes - Data Structures - 20
ecomputernotes
 
computer notes - Data Structures - 18
ecomputernotes
 
computer notes - Data Structures - 1
ecomputernotes
 
computer notes - Data Structures - 28
ecomputernotes
 
computer notes - Data Structures - 27
ecomputernotes
 
computer notes - Data Structures - 33
ecomputernotes
 
computer notes - Data Structures - 19
ecomputernotes
 
computer notes - Data Structures - 39
ecomputernotes
 
computer notes - Data Structures - 3
ecomputernotes
 
computer notes - Data Structures - 26
ecomputernotes
 
computer notes - Data Structures - 29
ecomputernotes
 
computer notes - Data Structures - 8
ecomputernotes
 
computer notes - Data Structures - 31
ecomputernotes
 
computer notes - Data Structures - 9
ecomputernotes
 
computer notes - Data Structures - 7
ecomputernotes
 
Ad

More from ecomputernotes (20)

PPT
computer notes - Data Structures - 30
ecomputernotes
 
PPT
computer notes - Data Structures - 11
ecomputernotes
 
PPT
computer notes - Data Structures - 15
ecomputernotes
 
DOC
Computer notes - Including Constraints
ecomputernotes
 
DOC
Computer notes - Date time Functions
ecomputernotes
 
DOC
Computer notes - Subqueries
ecomputernotes
 
DOC
Computer notes - Other Database Objects
ecomputernotes
 
PPT
computer notes - Data Structures - 13
ecomputernotes
 
DOC
Computer notes - Advanced Subqueries
ecomputernotes
 
DOC
Computer notes - Aggregating Data Using Group Functions
ecomputernotes
 
PPT
computer notes - Data Structures - 16
ecomputernotes
 
PPT
computer notes - Data Structures - 22
ecomputernotes
 
PPT
computer notes - Data Structures - 35
ecomputernotes
 
PPT
computer notes - Data Structures - 36
ecomputernotes
 
DOC
Computer notes - Enhancements to the GROUP BY Clause
ecomputernotes
 
DOC
Computer notes - Manipulating Data
ecomputernotes
 
DOC
Computer notes - Writing Basic SQL SELECT Statements
ecomputernotes
 
PPT
computer notes - Data Structures - 10
ecomputernotes
 
DOC
Computer notes - Controlling User Access
ecomputernotes
 
DOC
Computer notes - Using SET Operator
ecomputernotes
 
computer notes - Data Structures - 30
ecomputernotes
 
computer notes - Data Structures - 11
ecomputernotes
 
computer notes - Data Structures - 15
ecomputernotes
 
Computer notes - Including Constraints
ecomputernotes
 
Computer notes - Date time Functions
ecomputernotes
 
Computer notes - Subqueries
ecomputernotes
 
Computer notes - Other Database Objects
ecomputernotes
 
computer notes - Data Structures - 13
ecomputernotes
 
Computer notes - Advanced Subqueries
ecomputernotes
 
Computer notes - Aggregating Data Using Group Functions
ecomputernotes
 
computer notes - Data Structures - 16
ecomputernotes
 
computer notes - Data Structures - 22
ecomputernotes
 
computer notes - Data Structures - 35
ecomputernotes
 
computer notes - Data Structures - 36
ecomputernotes
 
Computer notes - Enhancements to the GROUP BY Clause
ecomputernotes
 
Computer notes - Manipulating Data
ecomputernotes
 
Computer notes - Writing Basic SQL SELECT Statements
ecomputernotes
 
computer notes - Data Structures - 10
ecomputernotes
 
Computer notes - Controlling User Access
ecomputernotes
 
Computer notes - Using SET Operator
ecomputernotes
 

Recently uploaded (20)

PPTX
Spectroscopy.pptx food analysis technology
nawahassan45
 
DOCX
The AUB Centre for AI in Media Proposal.docx
GAONE9
 
PDF
KodekX | Application Modernization Development
KodekX
 
PPTX
sap open course for s4hana steps from ECC to s4
sreeni2106invites
 
PDF
Reach Out and Touch Someone: Haptics and Empathic Computing
Mark Billinghurst
 
PPTX
Cloud computing and distributed systems.
kkkkkhan
 
PDF
Review of recent advances in non-invasive hemoglobin estimation
IAESIJAI
 
PDF
Agricultural_Statistics_at_a_Glance_2022_0.pdf
SandeepSingh286037
 
PDF
Machine learning based COVID-19 study performance prediction
IAESIJAI
 
PDF
Spectral efficient network and resource selection model in 5G networks
IAESIJAI
 
PDF
TokAI - TikTok AI Agent : The First AI Application That Analyzes 10,000+ Vira...
SOFTTECHHUB
 
PDF
cuic standard and advanced reporting.pdf
SimoneTitaniumTomase
 
PPT
“AI and Expert System Decision Support & Business Intelligence Systems”
ZubinRadhakrishnan
 
PDF
Mobile App Security Testing_ A Comprehensive Guide.pdf
flufftailshop
 
PDF
Optimiser vos workloads AI/ML sur Amazon EC2 et AWS Graviton
Julien SIMON
 
PDF
Encapsulation theory and applications.pdf
gurumoop
 
PPTX
Programs and apps: productivity, graphics, security and other tools
4mqw9zch22
 
PDF
Approach and Philosophy of On baking technology
30anthuong17
 
PPTX
20250228 LYD VKU AI Blended-Learning.pptx
DatVoNgoc
 
PPTX
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
ReZa AdineH
 
Spectroscopy.pptx food analysis technology
nawahassan45
 
The AUB Centre for AI in Media Proposal.docx
GAONE9
 
KodekX | Application Modernization Development
KodekX
 
sap open course for s4hana steps from ECC to s4
sreeni2106invites
 
Reach Out and Touch Someone: Haptics and Empathic Computing
Mark Billinghurst
 
Cloud computing and distributed systems.
kkkkkhan
 
Review of recent advances in non-invasive hemoglobin estimation
IAESIJAI
 
Agricultural_Statistics_at_a_Glance_2022_0.pdf
SandeepSingh286037
 
Machine learning based COVID-19 study performance prediction
IAESIJAI
 
Spectral efficient network and resource selection model in 5G networks
IAESIJAI
 
TokAI - TikTok AI Agent : The First AI Application That Analyzes 10,000+ Vira...
SOFTTECHHUB
 
cuic standard and advanced reporting.pdf
SimoneTitaniumTomase
 
“AI and Expert System Decision Support & Business Intelligence Systems”
ZubinRadhakrishnan
 
Mobile App Security Testing_ A Comprehensive Guide.pdf
flufftailshop
 
Optimiser vos workloads AI/ML sur Amazon EC2 et AWS Graviton
Julien SIMON
 
Encapsulation theory and applications.pdf
gurumoop
 
Programs and apps: productivity, graphics, security and other tools
4mqw9zch22
 
Approach and Philosophy of On baking technology
30anthuong17
 
20250228 LYD VKU AI Blended-Learning.pptx
DatVoNgoc
 
Effective Security Operations Center (SOC) A Modern, Strategic, and Threat-In...
ReZa AdineH
 

computer notes - Data Structures - 21

  • 1. Class No.21 Data Structures http://ecomputernotes.com
  • 2. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 3. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 4. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 5. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 6. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 7. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 8. TreeNode<int>* singleRightRotation(TreeNode<int>* k2) { if( k2 == NULL ) return NULL; // k1 (first node in k2's left subtree) // will be the new root TreeNode<int>* k1 = k2->getLeft(); // Y moves from k1's right to k2's left k2->setLeft( k1->getRight() ); k1->setRight(k2); // reassign heights. First k2 int h = Max(height(k2->getLeft()), height(k2->getRight())); k2->setHeight( h+1 ); // k2 is now k1's right subtree h = Max( height(k1->getLeft()), k2->getHeight()); k1->setHeight( h+1 ); return k1; }  k 1 k 2 Z Y X k 1 k 2 Z Y X singleRightRotation http://ecomputernotes.com
  • 9. int height( TreeNode<int>* node ) { if( node != NULL ) return node->getHeight(); return -1; }  height http://ecomputernotes.com
  • 10. int height( TreeNode<int>* node ) { if( node != NULL ) return node->getHeight(); return -1; }  height http://ecomputernotes.com
  • 11. TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
  • 12. TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
  • 13. TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
  • 14. TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
  • 15. TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
  • 16. TreeNode<int>* singleLeftRotation( TreeNode<int>* k1 ) { if( k1 == NULL ) return NULL; // k2 is now the new root TreeNode<int>* k2 = k1->getRight(); k1->setRight( k2->getLeft() ); // Y k2->setLeft( k1 ); // reassign heights. First k1 (demoted) int h = Max(height(k1->getLeft()), height(k1->getRight())); k1->setHeight( h+1 ); // k1 is now k2's left subtree h = Max( height(k2->getRight()), k1->getHeight()); k2->setHeight( h+1 ); return k2; }  k 1 k 2 X Y Z k 1 k 2 X Y Z singleLeftRotation http://ecomputernotes.com
  • 17. TreeNode<int>* doubleRightLeftRotation(TreeNode<int>* k1) { if( k1 == NULL ) return NULL; // single right rotate with k3 (k1's right child) k1->setRight( singleRightRotation(k1->getRight())); // now single left rotate with k1 as the root return singleLeftRotation(k1); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
  • 18. TreeNode<int>* doubleRightLeftRotation(TreeNode<int>* k1) { if( k1 == NULL ) return NULL; // single right rotate with k3 (k1's right child) k1->setRight( singleRightRotation(k1->getRight())); // now single left rotate with k1 as the root return singleLeftRotation(k1); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
  • 19. TreeNode<int>* doubleRightLeftRotation(TreeNode<int>* k1) { if( k1 == NULL ) return NULL; // single right rotate with k3 (k1's right child) k1->setRight( singleRightRotation(k1->getRight())); // now single left rotate with k1 as the root return singleLeftRotation(k1); }  k 1 k 2 D A B C k 3 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
  • 20. TreeNode<int>* doubleLeftRightRotation(TreeNode<int>* k3) { if( k3 == NULL ) return NULL; // single left rotate with k1 (k3's left child) k3->setLeft( singleLeftRotation(k3->getLeft())); // now single right rotate with k3 as the root return singleRightRotation(k3); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
  • 21. TreeNode<int>* doubleLeftRightRotation(TreeNode<int>* k3) { if( k3 == NULL ) return NULL; // single left rotate with k1 (k3's left child) k3->setLeft( singleLeftRotation(k3->getLeft())); // now single right rotate with k3 as the root return singleRightRotation(k3); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
  • 22. TreeNode<int>* doubleLeftRightRotation(TreeNode<int>* k3) { if( k3 == NULL ) return NULL; // single left rotate with k1 (k3's left child) k3->setLeft( singleLeftRotation(k3->getLeft())); // now single right rotate with k3 as the root return singleRightRotation(k3); }  k 1 k 3 D A B C k 2 k 1 k 3 D A B C k 2 doubleRightLeftRotation http://ecomputernotes.com
  • 23. Deletion in AVL Tree Delete is the inverse of insert: given a value X and an AVL tree T, delete the node containing X and rebalance the tree, if necessary. Turns out that deletion of a node is considerably more complex than insert http://ecomputernotes.com
  • 24. Deletion in AVL Tree Insertion in a height-balanced tree requires at most one single rotation or one double rotation. We can use rotations to restore the balance when we do a deletion. We may have to do a rotation at every level of the tree: log 2 N rotations in the worst case. http://ecomputernotes.com
  • 25. Deletion in AVL Tree Here is a tree that causes this worse case number of rotations when we delete A. At every node in N’s left subtree, the left subtree is one shorter than the right subtree. A C D N E J G I F H K L M http://ecomputernotes.com
  • 26. Deletion in AVL Tree Deleting A upsets balance at C. When rotate (D up, C down) to fix this A C D N E J G I F H K L M http://ecomputernotes.com
  • 27. Deletion in AVL Tree Deleting A upsets balance at C. When rotate (D up, C down) to fix this C D N E J G I F H K L M http://ecomputernotes.com
  • 28. Deletion in AVL Tree The whole of F’s left subtree gets shorter. We fix this by rotation about F-I: F down, I up. C D N E J G I F H K L M http://ecomputernotes.com
  • 29. Deletion in AVL Tree The whole of F’s left subtree gets shorter. We fix this by rotation about F-I: F down, I up. C D N E J G I F H K L M http://ecomputernotes.com
  • 30. Deletion in AVL Tree This could cause imbalance at N. The rotations propagated to the root. C D N E J G I F H K L M http://ecomputernotes.com
  • 31. Deletion in AVL Tree Procedure Delete the node as in binary search tree (BST). The node deleted will be either a leaf or have just one subtree. Since this is an AVL tree, if the deleted node has one subtree, that subtree contains only one node (why?) Traverse up the tree from the deleted node checking the balance of each node. http://ecomputernotes.com
  • 32. Deletion in AVL Tree There are 5 cases to consider. Let us go through the cases graphically and determine what action to take. We will not develop the C++ code for deleteNode in AVL tree. This will be left as an exercise. http://ecomputernotes.com
  • 33. Deletion in AVL Tree Case 1a : the parent of the deleted node had a balance of 0 and the node was deleted in the parent’s left subtree. Action : change the balance of the parent node and stop. No further effect on balance of any higher node. Delete on this side http://ecomputernotes.com
  • 34. Deletion in AVL Tree Here is why; the height of left tree does not change. 1 2 3 4 5 6 7 0 1 2
  • 35. Deletion in AVL Tree Here is why; the height of left tree does not change. 1 2 3 4 5 6 7 2 3 4 5 6 7 0 1 2 remove(1)
  • 36. Deletion in AVL Tree Case 1b : the parent of the deleted node had a balance of 0 and the node was deleted in the parent’s right subtree. Action : (same as 1a ) change the balance of the parent node and stop. No further effect on balance of any higher node. Delete on this side
  • 37. Deletion in AVL Tree Case 2a : the parent of the deleted node had a balance of 1 and the node was deleted in the parent’s left subtree. Action : change the balance of the parent node. May have caused imbalance in higher nodes so continue up the tree. Delete on this side

Editor's Notes

  • #3: Start of lecture 23
  • #34: Start of lecture 24
  • #38: End of lecture 23.